A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer

نویسنده

  • Christian Wüthrich
چکیده

There exists a growing literature on the so-called physical ChurchTuring thesis in a relativistic spacetime setting. The physical ChurchTuring thesis is the conjecture that no computing device that is physically realizable (even in principle) can exceed the computational barriers of a Turing machine. By suggesting a concrete implementation of a beyond-Turing computer in a spacetime setting, István Németi and Gyula Dávid (2006) have shown how an appreciation of the physical Church-Turing thesis necessitates the confluence of mathematical, computational, physical, and indeed cosmological ideas. In this essay, I will honour István’s seventieth birthday, as well as his longstanding interest in, and his seminal contributions to, this field going back to as early as 1987 by modestly proposing how the concrete implementation in Németi and Dávid (2006) might be complemented by a quantuminformation-theoretic communication protocol between the computing device and the logician who sets the beyond-Turing computer a task such as determining the consistency of Zermelo-Fraenkel set theory. This suggests that even the foundations of quantum theory and, ultimately, quantum gravity may play an important role in determining the validity of the physical Church-Turing thesis. ∗I am grateful to István Németi and Hajnal Andréka for discussions on the topic and for their willingness to share old material from their personal archive. I thank Gergely Székely for his great patience with my procrastinating, Joseph Berkovitz and Kent Peacock for correspondence, and the audience at the István-Fest, as well as John Dougherty and the referees for this journal for comments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beyond Quantum Computation and Towards Quantum Field Computation

Because the subject of relativistic quantum field theory (QFT) contains all of non-relativistic quantum mechanics, we expect quantum field computation to contain (non-relativistic) quantum computation. Although we do not yet have a quantum theory of the gravitational field, and are far from a practical implementation of a quantum field computer, some pieces of the puzzle (without gravity) are n...

متن کامل

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

متن کامل

Optimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits

There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....

متن کامل

Machines, computations and time; when P can be equal NP

The theory of computability is a mathematical abstraction that has proved to be very handy in explaining and foreseeing many facts about the computers, as we know them today. Yet, existing computers are objects embedded in our physical word and as such have to behave according to the laws of physics. This observation has had stunning consequences for our understanding of computations. For insta...

متن کامل

Some results on the complement of a new graph associated to a commutative ring

The rings considered in this article are commutative with identity which are not fields. Let R be a ring. A. Alilou, J. Amjadi and Sheikholeslami introduced and investigated a graph whose vertex set is the set of all nontrivial ideals of R and distinct vertices I, J are joined by an edge in this graph if and only if either ann(I)J = (0) or ann(J)I = (0). They called this graph as a new graph as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Synthese

دوره 192  شماره 

صفحات  -

تاریخ انتشار 2015